Retrofitting Post-Quantum Cryptography in Internet Protocols:A Case Study of DNSSEC

Quantum computing is threatening current cryptography, especially the asymmetric algorithms used in many Internet protocols. More secure algorithms, colloquially referred to as Post-Quantum Cryptography (PQC), are under active development. These new algorithms differ significantly from current ones. They can have larger signatures or keys, and often require more computational power. This means we cannot just replace existing algorithms by PQC alternatives, but need to evaluate if they meet the requirements of the Internet protocols that rely on them. In this paper we provide a case study, analyzing the impact of PQC on the Domain Name System (DNS) and its Security Extensions (DNSSEC). In its main role, DNS translates human-readable domain names to IP addresses and DNSSEC guarantees message integrity and authenticity. DNSSEC is particularly challenging to transition to PQC, since DNSSEC and its underlying transport protocols require small signatures and keys and efficient validation. We evaluate current candidate PQC signature algorithms in the third round of the NIST competition on their suitability for use in DNSSEC. We show that three algorithms, partially, meet DNSSEC’s requirements but also show where and how we would still need to adapt DNSSEC. Thus, our research lays the foundation for making DNSSEC, and protocols with similar constraints ready for PQC

Distributed Event-driven Simulation: Scheduling Strategies and Resource Management

Optimistic parallel discrete event simulation method is applied to large scale data parallel applications. Specificly, optimizations for state saving of large state vectors and bounded optimism are incorporated in the simulation environment. Dynamic load balancing is studied, and a checkpoint and migration mechanism is implemented and integrated with the PVM message passing environment

Parallel Discrete Event Simulation

In simulating applications for execution on specific computing systems, the simulation performance figures must be known in a short period of time. One basic approach to the problem of reducing the required simulation time is the exploitation of parallelism. However, in parallelizing the simulation new problems arise. Due to the distributed generation of events causality errors can occur, as a result the sequence in which to process the events is essentially indeterminated. In this paper we present a model to analyse the inherent parallelism of a simulation, together with a survey of existing strategies to perform the simulation in parallel. Some extensions to this model are discussed, resulting in reliable evaluation of the effectiveness of these strategies. 1 Introduction In the Parallel Scientific Computing Working-group at the University of Amsterdam, we are interested in the execution performance of classes of applications on classes of computing systems. We distinguish the follo..

Distributed Event-driven Simulation Scheduling Strategies and Resource Management

ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof. dr J.J.M. Franse ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op donderdag 9 november 2000 te 12:00 uur doo

Conceptual design of high performance glider with electric propulsion (in complience with EASA CS-22)

Diplomová práce se věnuje koncepčnímu návrhu kluzáku s elektrickým pohonem dle předpisu CS-22. Je zpracován statistický rozbor kluzáků s pomocným pohonem, který je použit pro stanovení základních návrhových parametrů, ze kterých koncepční návrh vychází. Na základě analytické poláry odhadu odporu jsou vypočteny letové výkony, zejména dolet a vliv solárních panelů na dolet. Práce obsahuje konstrukční návrh zástavby akumulátorů do křídla.This master's thesis is focused on conceptual design of glider with electric propulsion system following the CS-22 regulation. Statistical analysis of the glider with an auxiliary electric engine has been carried out in order to determine basic design parameters for conceptual design. Based on analytical drag polar, the flight performance parameters are calculated, in particular flight range and influence of the solar panels on the flight range. This thesis also includes preliminary design solution of accumulator placement within the wing.

Parallel Performance Evaluation through Critical Path Analysis

. In this paper we discuss the concept of space-time diagrams as a representation of the execution of an application, and then give a method, based on critical path analysis, for calculating nontrivial upper bounds on the potential parallelism, known as the average parallelism, a complement to the speedup and efficiency. 1 Introduction Two measures of particular interest in parallel performance evaluation are speedup and efficiency. Notwithstanding the importance of these two measures, they do not reveal how well the potential parallelism in the application is exploited. Nor do they help to understand why the performance may not be as good as expected. In this paper we describe a new method called critical path analysis to measure the potential parallelism available in the application. Furthermore, critical path analysis can be used as a tool for bottleneck analysis to improve the potential performance on a parallel system. The potential parallelism in an application can be quan..

Extensions to Time Warp Parallel Simulation for Spatial Decomposed Applications

In recent years, the use of discrete event simulation to solve problems from natural sciences has become more common as the dynamic time evolution of the real-world system is naturally incorporated in the discrete event system model. The parallel simulation of these discrete event systems puts some extra requirements on the parallel synchronization schemes such as Time Warp. The large scientific problems require efficient memory management--- both time and space efficient---and parallelism control to achieve satisfactory performance

Abstract Extensions to Time Warp Parallel Simulation for Spatial Decomposed Applications

In recent years, the use of discrete event simulation to solve problems from natural sciences has become more common as the dynamic time evolution of the real-world system is naturally incorporated in the discrete event system model. The parallel simulation of these discrete event systems puts some extra requirements on the parallel synchronization schemes such as Time Warp. The large scientific problems require efficient memory management— both time and space efficient—and parallelism control to achieve satisfactory performance.